Investigating the recoverable robust single machine scheduling problem under interval uncertainty

We investigate the recoverable robust single machine scheduling problem under interval uncertainty. In this setting, jobs have first-stage processing times p and second-stage q we aim to find a schedule with minimum combined sum of completion times, such that at least Δ share same position in both schedules. provide positive complexity results for some important special cases problem, as well derive 2-approximation algorithm full problem. Computational experiments examine performance an exact mixed-integer programming formulation approximation algorithm, demonstrate strength proposed polynomial time greedy heuristic.